Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
331	6.856 — Randomized Algorithms David Karger Handout #1, February 2, 2011 — Course Outline Course page. http://courses.csail.mit.edu[removed]Lecturer. David Karger, [removed]. URL: http://people.csail.mit.edu/karge Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2013-02-03 01:32:42 Probabilistic complexity theory Analysis of algorithms Operations research Computational complexity theory Algorithm Randomized algorithm Linear programming Probabilistic analysis of algorithms Combinatorial optimization Theoretical computer science Applied mathematics Mathematics
332	Complexity - Measure complexity of C source For version 0.4, updated May 2011 Bruce Korb [removed] Add to Reading List Source URL: www.gnu.org Language: English - Date: 2011-05-15 15:09:33 Complexity classes Procedural programming languages C Cross-platform software Boolean data type SQL Bracket FO Relational operator Computing Software engineering Notation
333	TE C H N I C A L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN UND A RTIFICIAL I NTELLIGENCE Add to Reading List Source URL: www.dbai.tuwien.ac.at Language: English - Date: 2014-05-05 09:39:38 Complexity classes Logic programming Mathematical optimization Operations research Answer set programming NP-complete problems Stable model semantics Tree decomposition NP-complete Theoretical computer science Computational complexity theory Applied mathematics
334	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 15, 2011 Problem Set 2 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-25 21:36:41 Computer science Programming idioms Computational complexity theory Asymptotic analysis Recursion Theory of computation Rendering Big O notation Time complexity Theoretical computer science Analysis of algorithms Mathematics
335	TE C HNI C A L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN Add to Reading List Source URL: www.dbai.tuwien.ac.at Language: English - Date: 2011-07-08 05:36:04 Tree decomposition Clique-width Clique Dynamic programming Parameterized complexity Path decomposition Clique-sum Graph theory Theoretical computer science Graph operations
336	LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-07-12 04:32:05 Mathematics Mathematical optimization Approximation algorithms Complexity classes Planning Job shop scheduling Polynomial-time approximation scheme Scheduling Dynamic programming Operations research Applied mathematics Theoretical computer science
337	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth G¨ unther∗† Olaf Maurer∗† Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:18:02 Operations research Analysis of algorithms Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Linear programming Scheduling Online algorithm Theoretical computer science Applied mathematics Computational complexity theory
338	Inexcusable Complexity for 40 years Edward S. Lowry Bedford Mass. [removed] users.rcn.com/eslowry DRAFT Add to Reading List Source URL: users.rcn.com Language: English - Date: 2013-06-24 14:20:04 Cross-platform software Functional languages Computer languages Notation Programming language Data model C++ Modeling language Database Computing Software engineering Science
339	Mathematics and computing RAVINDRAN KANNAN Microsoft Research Labs., India e-mail: [removed] The interaction of computing and mathematics Add to Reading List Source URL: www.ias.ac.in Language: English - Date: 2010-02-23 07:06:41 Operations research Analysis of algorithms Convex optimization Linear programming Randomized algorithm Ellipsoid method NP Time complexity Ravi Kannan Theoretical computer science Applied mathematics Computational complexity theory
340	Today’s topics Computing factorial • Orders of growth of processes • Relating types of procedures to different orders of growth Add to Reading List Source URL: sicp.csail.mit.edu Language: English - Date: 2007-02-15 21:09:43 Programming idioms Analysis of algorithms Computational complexity theory Computability theory Recursion Scheme Factorial Big O notation Time complexity Mathematics Theoretical computer science Computer programming